Non-primitive Recursive Function Definitions
نویسندگان
چکیده
منابع مشابه
Non-primitive Recursive Function Definitions
This paper presents an approach to the problem of introducing non-primitive recursive function definitions in higher order logic. A recursive specification is translated into a domain theory version, where the recursive calls are treated as potentially non-terminating. Once we have proved termination, the original specification can be derived easily. A collection of algorithms are presented whi...
متن کاملNon Primitive Recursive Complexity Classes
The introduction of Well Structured Transition Systems (WSTS) in 1987 [8], i.e. transition systems that satisfies a monotony property with respect to some well-quasi-ordering (wqo), has led to an important number of decidability results of verification problems for several natural models: Petri Nets and VASS and a large number of their extensions, lossy channel systems, string rewrite systems, ...
متن کاملCharacterizing Complexity Classes By Higher Type Primitive Recursive Definitions
Higher type primitive recursive definitions (also known as G~del's system T) defining first-order functions (i.e. functions of type ind---~...~ind--~ind, ind for individuals, higher types occur in between) can be classified into an infinite syntactic hierarchy: A definition is in the n'th stage of this hierarchy, a so called rank-n-definition, iff n is an upper bound on the levels of the types ...
متن کاملPrimitive Recursive Functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...
متن کاملExtended Primitive Recursive Functions
— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1995
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v2i36.19939